AnswerArt %2D Contextualized Question Answering.

Real%2DTime News Recommender System.

Social Network Analysis of Ontology Edit Logs.

Visualization of Web Page Content Using Semantic Technologies.

Social Network Analysis of Ontology Edit Logs.



Machine Learning and Knowledge Discovery in Databases
Knowledge discovery in databases is not only the nontrivial extraction of implicit, previously unknown and potentially useful information from databases. We argue that in contrast to machine learning, knowledge discovery in databases should be applied to real world databases. Since real world databases are known to be very large, they raise problems of the access. Therefore, real world databases only can be accessed by database management systems and the number of accesses has to be reduced to a minimum. Considering this property, we are forced to use, for example, standard set oriented interfaces of relational database management systems in order to apply methods of knowledge discovery in databases. We present a system for discovering data dependencies, which is build upon a set oriented interface. The point of main effort has been put on the discovery of value restrictions, unary inclusion- and functional dependencies in relational databases. The system also embodies an inference rel...
Modeling Common Real%2DWord Relations Using Triples Extracted from n%2DGrams.

Entity Resolution in Texts Using Statistical Learning and Ontologies.

Enhanced Web Page Content Visualization with Firefox.

Visual OntoBridge Semi%2Dautomatic Semantic Annotation Software.

Semi%2Dautomatic Categorization of Videos on VideoLectures.net.

Demo HistoryViz %2D Visualizing Events and Relations Extracted from Wikipedia.

Semantic web wiki Social network analysis of page editing.

Document Visualization Based on Semantic Graphs.

Visual analysis of documents with semantic graphs.


Constructing Event Templates from Written News.


Semantic Technology for Capturing Communication Inside an Organization.

Semantic Graphs Derived From Triplets with Application in Document Summarization.

Guest editors%27 introduction Special Issue from ECML PKDD 2009.

Predicting Category Additions in a Topic Hierarchy.

Monitoring Network Evolution using MDL.
Abstract — Given publication titles and authors, what can we say about the evolution of scientific topics and communities over time? Which communities shrunk, which emerged, and which split, over time? And, when in time were the turning points? We propose TimeFall, which can automatically answer these questions given a social network/graph that evolves over time. The main novelty of the proposed approach is that it needs no user-defined parameters, relying instead on the principle of Minimum Description Length (MDL), to extract the communities, and to find good cut-points in time when communities change abruptly: a cut-point is good, if it leads to shorter data description. We illustrate our algorithm on synthetic and large real datasets, and we show that the results of the TimeFall agree with human intuition. I.
Cross%2Dlingual search over 22 european languages.

Ripple Down Rule learning for automated word lemmatisation.

Feature Selection for the Classification of Large Document Collections.

Machine Learning ECML 2007

Machine Learning ECML 2007

OntoGen Semi%2Dautomatic Ontology Editor.
Abstract. In this paper we present a semi-automatic ontology editor as implemented in a new version of OntoGen system. The system integrates machine learning and text mining algorithms into an efficient user interface lowering the entry barrier for users who are not professional ontology engineers. The main features of the systems include unsupervised and supervised methods for concept suggestion and concept naming, as well as ontology and concept visualization. The system was tested in extensive user trails and in several realworld scenarios with very positive results.
Knowledge Discovery in Databases PKDD 2007

From Web to Social Web Discovering and Deploying User and Content Profiles

OntoGen Semi%2Dautomatic Ontology Editor.
Abstract. In this paper we present a semi-automatic ontology editor as implemented in a new version of OntoGen system. The system integrates machine learning and text mining algorithms into an efficient user interface lowering the entry barrier for users who are not professional ontology engineers. The main features of the systems include unsupervised and supervised methods for concept suggestion and concept naming, as well as ontology and concept visualization. The system was tested in extensive user trails and in several realworld scenarios with very positive results.
Using Text Mining and Link Analysis for Software Mining.

Using Text Mining and Link Analysis for Software Mining.

Extracting Named Entities and Relating Them over Time Based on Wikipedia.
This paper presents an approach to mining information relating people, places, organizations and events extracted from Wikipedia and linking them on a time scale. The approach consists of two phases: (1) identifying relevant pages- categorizing the articles as containing people, places or organizations; (2) generating timeline- linking named entities and extracting events and their time frame. We illustrate the proposed approach on 1.7 million Wikipedia articles. Povzetek: Predstavljene so metode rudarjenja informacij iz Wikipedie in urejanje v časovno zgradbo. 1
Semantics
We address the issue of semantics for an agent communication language. In particular,
Comparing and Combining Two Approaches to Automated Subject Classification of Text.
Abstract. A machine-learning and a string-matching approach to automated subject classification of text were compared, as to their performance, advantages and downsides. The former approach was based on an SVM algorithm, while the latter comprised string-matching between a controlled vocabulary and words in the text to be classified. Data collection consisted of a subset from Compendex, classified into six different classes. It was shown that SVM on average outperforms the string-matching approach: our hypothesis that SVM yields better recall and string-matching better precision was confirmed only on one of the classes. The two approaches being complementary, we investigated different combinations of the two based on combining their vocabularies. The results have shown that the original approaches, i.e. machine-learning approach without using background knowledge from the controlled vocabulary, and string-matching approach based on controlled vocabulary, outperform approaches in which combinations of automatically and manually obtained terms were used. Reasons for these results need further investigation, including a larger data collection and combining the two using predictions. 1
Background knowledge for ontology construction.
knowledge for ontology construction
User Profiling for the Web.
Abstract. While browsing the Web, providing profile information in social networking services, or tagging pictures, users leave a plethora of traces. In this paper, we analyze the nature of these traces. We investigate how user data is distributed across different Web systems, and examine ways to aggregate user profile information. Our analyses focus on both explicitly provided profile information (name, homepage, etc.) and activity data (tags assigned to bookmarks or images). The experiments reveal significant benefits of interweaving profile information: more complete profiles, advanced FOAF/vCard profile generation, disclosure of new facets about users, higher level of self-information induced by the profiles, and higher precision for predicting tag-based profiles to solve the cold start problem. 1
Semi%2Dautomatic Construction of Topic Ontologies.
knowledge for ontology construction
Using String Kernels for Classification of Slovenian Web Documents.

Applying Collaborative Filtering to Real%2Dlife Corporate Data.

Text Classification with Active Learning.
This paper shows how a text classifier&#039;s need for labeled training data can be reduced by a combination of active learning and Expectation Maximization (EM) on a pool of unlabeled data. Query-by-Committee is used to actively select documents for labeling, then EM with a naive Bayes model further improves classification accuracy by concurrently estimating probabilistic labels for the remaining unlabeled documents and using them to improve the model. We also present a metric for better measuring disagreement among committee members; it accounts for the strength of their disagreement and for the distribution of the documents. Experimental results show that our method of combining EM and active learning requires only half as many labeled training examples to achieve the same accuracy as either EM or active learning alone. Keywords:  text classification active learning unsupervised learning information retrieval  1 Introduction  In many settings for learning text classifiers, obtaining lab...
Text Mining in Action%21.

Feature Selection for Dimensionality Reduction.
Finding reliable, meaningful patterns in data with high numbers of attributes can be extremely difficult. Feature selection helps us to decide what attributes or combination of attributes are most important for finding these patterns. In this chapter, we study feature selection methods for building classification models from high-throughput genomic (microarray) and proteomic (mass spectrometry) data sets. Thousands of feature candidates must be analyzed, compared and combined in such data sets. We describe the basics of four different approaches used for feature selection and illustrate their effects on an MS cancer proteomic data set. The closing discussion provides assistance in performing an analysis in high-dimensional genomic and proteomic data
Data Sparsity Issues in the Collaborative Filtering Framework.
Abstract. With the amount of available information on the Web growing rapidly with each day, the need to automatically filter the information in order to ensure greater user efficiency has emerged. Within the fields of user profiling and Web personalization several popular content filtering techniques have been developed. In this chapter we present one of such techniques – collaborative filtering. Apart from giving an overview of collaborative filtering approaches, we present the experimental results of confronting the k-Nearest Neighbor (kNN) algorithm with Support Vector Machine (SVM) in the collaborative filtering framework using datasets with different properties. While the k-Nearest Neighbor algorithm is usually used for collaborative filtering tasks, Support Vector Machine is considered a state-of-the-art classification algorithm. Since collaborative filtering can also be interpreted as a classification/regression task, virtually any supervised learning algorithm (such as SVM) can also be applied. Experiments were performed on two standard, publicly available datasets and, on the other hand, on a real-life corporate dataset that does not fit the profile of ideal data for collaborative filtering. We conclude that the quality of collaborative filtering recommendations is highly dependent on the sparsity of available data. Furthermore, we show that kNN is dominant on datasets with relatively low sparsity while SVMbased approaches may perform better on highly sparse data. 1
The Workshops at the Twentieth National Conference on Artificial Intelligence.

Simple Classification into Large Topic Ontology of Web Documents.
Abstract- This paper is conceived as a summary of previous works that explored many alternative learning models for classification of documents on structured outputs. We provide a discussion of strong and weak points for each method. I.
Visualization of Text Document Corpus.
Visualization is commonly used in data analysis to help the user in getting an initial idea about the raw data as well as visual representation of the regularities obtained in the analysis. In similar way, when we talk about automated text processing and the data consists of text documents, visualization of text document corpus can be very useful. From the automated text processing point of view, natural language is very redundant in the sense that many different words share a common or similar meaning. For computer this can be hard to understand without some background knowledge. We describe an approach to visualization of text document collection based on methods from linear algebra. We apply Latent Semantic Indexing (LSI) as a technique that helps in extracting some of the background knowledge from corpus of text documents. This can be also viewed as extraction of hidden semantic concepts from text documents. In this way visualization can be very helpful in data analysis, for instance, for finding main topics that appear in larger sets of documents. Extraction of main concepts from documents using techniques such as LSI, can make the results of visualizations more useful. For example, given a set of descriptions of European Research projects (6FP) one can find main areas that these projects cover including semantic web, e-learning, security, etc. In this paper we describe a method for visualization of document corpus based on LSI, the system implementing it and give results of using the system on several datasets. Povzetek: Predstavljena je vizualizacija korpusa besedil. 1
Building Minority Language Corpora by Learning to Generate Web Search Queries.
The Web is an obvious source of valuable information but the process of collecting, organizing and utilizing these resources is difficult. We describe CorpusBuilder, an approach for automatically generating Web-search queries for collecting documents matching a minority concept. We use the concept of text documents belonging to a minority natural language on the Web. Individual documents are automatically labeled as relevant or non-relevant using a language filter and the feedback is used to learn what query-lengths and inclusion/exclusion term-selection methods are helpful for finding previously unseen documents in the target language. Our system learns to select good query terms using a variety of term scoring methods. We find that using odds-ratio  scores calculated over the documents acquired so far was one of the most consistently accurate query-generation methods. We also parameterize the query length using a Gamma distribution and present empirical results with learning methods that vary the time horizon used when learning from the results of past queries. We find that our systems performs well whether we initialize it with a whole document, or with a handful of words elicited from a user. Experiments applying the same approach to multiple languages are also presented showing that our approach generalizes well across several languages regardless of the initial conditions. 1. 
KDD%2D2005 workshop report Link Discovery issues

Web Mining From Web to Semantic Web

Visualizing Very Large Graphs Using Clustering Neighborhoods.
Abstract. This paper presents a method for visualization of large graphs in a two-dimensional space, such as a collection of Web pages. The main contribution here is in the representation change to enable better handling of the data. The idea of the method consists from three major steps: (1) First, we transform a graph into a sparse matrix, where for each vertex in the graph there is one sparse vector in the matrix. Sparse vectors have non-zero components for the vertices that are close to the vertex represented by the vector. (2) Next, we perform hierarchical clustering (eg., hierarchical K-Means) on the set of sparse vectors, resulting in the hierarchy of clusters. (3) In the last step, we map hierarchy of clusters into a two-dimensional space in the way that more similar clu sters appear closely on the picture. The effect of the whole procedure is that we assign unique X and Y coordinates to each vertex, in a way those vertices or groups of vert ices on several levels of hierarchy that are stronger connected in a graph are place closer in the picture. The method is particular useful for power distributed graphs. We show applications of the method on real-world examples of visualization of institution collaboration graph and cro ss-sell recomme ndation graph. 1
Feature selection using linear classifier weights interaction with classification models.
This paper explores feature scoring and selection based on weights from linear classification models. It investigates how these methods combine with various learning models. Our comparative analysis includes three learning algorithms: Naïve Bayes, Perceptron, and Support Vector Machines (SVM) in combination with three feature weighting methods: Odds Ratio, Information Gain, and weights from linear models, the linear SVM and Perceptron. Experiments show that feature selection using weights from linear SVMs yields better classification performance than other feature weighting methods when combined with the three explored learning algorithms. The results support the conjecture that it is the sophistication of the feature weighting method rather than its apparent compatibility with the learning algorithm that improves classification performance.
KDD%2D2004 workshop report link analysis and group detection %28LinkKDD%2D2004%29.

A Roadmap for Web Mining From Web to Semantic Web.

Mapping Documents onto Web Page Ontology.

Feature selection on hierarchy of web documents.

Learning word normalization using word suffix and context from unlabeled data.

Modeling Information in Textual Data Combining Labeled and Unlabeled Data.

Mining the Web to Create Minority Language Corpora.
The Web is a valuable source of language specific resources but the process of collecting, organizing and utilizing these resources is difficult. We describe CorpusBuilder, an approach for automatically generating Web-search queries for collecting documents in a minority language. It differs from pseudo-relevance feedback in that retrieved documents are labeled by an automatic language classifier as relevant or irrelevant, and this feedback is used to generate new queries. We experiment with various query-generation methods and query-lengths to find inclusion/exclusion terms that are helpful  for retrieving documents in the target language and find that using odds-ratio scores calculated over the documents acquired so far was one of the most consistently accurate query-generation methods. We also describe experiments using a handful of words elicited from a user instead of initial documents and show that the methods perform similarly. Experiments applying the same approach to multiple languages are also presented showing that our approach generalizes to a variety of languages.  1. 
Automatic Web Search Query Generation to Create Minority Language Corpora.
In this paper, we describe techniques which only require the user to give a handful of keywords or documents for automatically collecting language specific resources from the Web and present a system which automatically generates Web search queries to construct corpora for minority languages. Our proposed approach requires no human intervention once the system is provided with a freely available language filter and initial documents in the target language. It is orders of magnitude more efficient than fitting a crawler with a language filter.
Online Learning for Web Query Generation Finding Documents Matching a Minority Concept on the Web.
. This paper describes an approach for learning to generate  web-search queries for collecting documents matching a minority concept.  As a case study we use the concept of text documents belonging  to Slovenian, a minority natural language on the Web. Individual  documents are automatically labeled as relevant or non-relevant using  a language filter and the feedback is used to learn what query-lengths  and inclusion/exclusion term-selection methods are helpful for finding  previously unseen documents in the target language. Our system, CorpusBuilder,  learns to select &#034;good&#034; query terms using a variety of term  scoring methods. We present empirical results with learning methods  that vary the time horizon used when learning from the results of past  queries. Our approaches generalize well across several languages regardless  of the initial conditions.  1 
Data mining of baskets collected at different locations over one year.

Text mining %28workshop session %2D title only%29.

Text Mining as Integration of Several Related Research Areas Report on KDD%272000 Workshop on Text Mining.
In this paper we give an overview of the KDD&#039;2000 Workshop on Text Mining that was held in Boston, MA on August 20, 2000.  We report in detail on the research issues covered in the papers  presented at the Workshop and during the group discussion held  in the final session of the Workshop.  Keywords  Text mining, information extraction, information retrieval, natural language processing, KDD workshop report.  1. INTRODUCTION  The growing importance of electronic media for storing and disseminating text documents has created a burning need for tools and techniques that assist users in finding and extracting relevant information from large data repositories. Information management of well organized and maintained structured databases has been a focus of the Data Mining research for quite sometime now. However, with the emergence of the World Wide Web, there is a need for extending this focus to mining information from unstructured and semi-structured information sources such as on-line n...
Feature Selection for Unbalanced Class Distribution and Naive Bayes.
This paper describes an approach to feature subset selection that takes into account problem specifics and learning algorithm characteristics. It is developed for the Naive Bayesian classifier applied on text data, since it combines well with the addressed learning problems. We focus on domains with many features that also have a highly unbalanced class distribution and asymmetric misclassification costs given only implicitly in the problem. By asymmetric misclassification costs we mean that one of the class values is the target class value for which we want to get predictions and we prefer false positive over false negative. Our example problem is automatic document categorization using machine learning, where we want to identify documents relevant for the selected category. Usually, only about 1%-10% of examples belong to the selected category. Our experimental comparison of eleven feature scoring measures show that considering domain and algorithm characteristics significantly impro...
Turning Yahoo to Automatic Web%2DPage Classifier.
. The paper describes an approach to automatic Web-page classification based on the Yahoo hierarchy. Machine learning techniques developed for learning on text data are used here on the hierarchical classification structure. The high number of features is reduced by taking into account the hierarchical structure and using feature subset selection based on the method known from information retrieval. Documents are represented as feature-vectors that include n-grams instead of including only single words (unigrams) as commonly used when learning on text data. Based on the hierarchical structure the problem is divided into subproblems, each representing one on the categories included in the Yahoo hierarchy. The result of learning is a set of independent classifiers, each used to predict the probability that a new example is a member of the corresponding category. Experimental evaluation on real-world data shows that the proposed approach gives good results. For more than a half of testing...
Feature Subset Selection in Text%2DLearning.
This paper describes several known and some new methods for feature subset selection on large text data. Experimental comparison given on real-world data collected from Web users shows that characteristics of the problem domain and machine learning algorithm should be considered when feature scoring measure is selected. Our problem domain consists of hyperlinks given in a form of small-documents represented with word vectors. In our learning experiments naive Bayesian classifier was used on text data. The best performance was achieved by the feature selection methods based on the feature scoring measure called Odds ratio that is known from information retrieval.
Browsing%2DAssistenten%2C Tour Guides und adaptive WWW%2DServer.

Using machine learning for outcome prediction of patients with severe head injury.

Using Machine Learning Techniques to Interpret Results from Discrete Event Simulation.

Combinatorial Optimization in Inductive Concept Learning.

Visualization of Domain and Concept Descriptions.

Stochastic Search in Inductive Logic Programming.
Abstract. Stochastically searching the space of candidate clauses is an appealing way to scale up ILP to large datasets. We address an approach that uses a Bayesian network model to adaptively guide search in this space. We examine guiding search towards areas that previously performed well and towards areas that ILP has not yet thoroughly explored. We show improvement in area under the curve for recall-precision curves using these modifications. 1
